Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT
نویسندگان
چکیده
منابع مشابه
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G if the removal of any member of F from G leaves a forest, and every vertex v ∈ V (G) is contained in at most w(v) members of F . The weight of a cycle C in G is the sum of w(v), over all vertices v of C. The purpose of ...
متن کاملNatural Max-SAT Encoding of Min-SAT
We show that there exists a natural encoding which transforms Min-SAT instances into Max-SAT instances. Unlike previous encodings, this natural encoding keeps the same variables, and the optimal assignment for the Min-SAT instance is identical to the optimal assignment of the corresponding Max-SAT instance. In addition to that the encoding can be generalized to the Min-SAT variants with clause ...
متن کاملPreprocessing of Min Ones Problems: A Dichotomy
A parameterized problem consists of a classical problem and an additional component, the so-called parameter. This point of view allows a formal definition of preprocessing: Given a parameterized instance (I, k), a polynomial kernelization computes an equivalent instance (I , k) of size and parameter bounded by a polynomial in k. We give a complete classification of Min Ones Constraint Satisfac...
متن کاملDifferential Approximation of min sat, max sat and Related Problems
We present differential approximation results (both positive and negative) for optimal satisfiability, optimal constraint satisfaction, and some of the most popular restrictive versions of them. As an important corollary, we exhibit an interesting structural difference between the landscapes of approximability classes in standard and differential paradigms.
متن کاملThe min-cut and vertex separator problem
We consider graph three-partitions with the objective of minimizing the number of edges between the first two partition sets while keeping the size of the third block small. We review most of the existing relaxations for this min-cut problem and focus on a new class of semidefinite relaxations, based on matrices of order 2n+ 1 which provide a good compromise between quality of the bound and com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.11.009